Two-Level Boolean Minimizer BOOM-II
نویسندگان
چکیده
We propose a novel two-level Boolean minimizer coming in succession to our previously developed minimizer BOOM, so we have named it BOOM-II. It is a combination of two minimizers, namely BOOM and FC-Min. Each of these two methods has its own area where it is most efficiently applicable. We have combined these two methods together to be able to solve all kinds of problems efficiently, independently on their size or nature. The tool is very scalable in terms of the required runtime and/or the quality of the solution. It is applicable to functions with an extremely large number of both input and output variables.
منابع مشابه
Single-level Partitioning Support in Boom-ii
We propose a modification of our Boolean minimizer BOOM-II enabling a single-level partitioning. The disadvantage of all the present logic synthesis systems is that the minimization and decomposition phases are strictly separated; the minimization process is independent on the subsequent decomposition. We propose a method where the two-level minimization is driven by some decomposition or other...
متن کاملSAT-Based Algorithms for Logic Minimization
This paper introduces a new method for two-level logic minimization. Unlike previous approaches, the new method uses a SAT solver as an underlying engine. While the overall minimization strategy of the new method is based on the operators as defined in ESPRESSO-II, our SAT-based implementation is significantly different. The new minimizer SAT-ESPRESSO was found to perform 5–20 times faster than...
متن کاملA Flexible Minimization and Partitioning Method
The article describes a new Boolean minimization and single-level partitioning method based on the BOOM minimizer. The minimization is performed with respect to various restrictions stated for the use of input variables. This enables us to effectively decompose the circuit into several components for which the numbers of inputs and outputs are explicitly specified. The method can thus be used t...
متن کاملThe Iterative Boolean Minimizer Fc-min
A novel two-level Boolean minimization method is presented here. In contrast to classical methods the cover of the on-set is computed first, whilst no implicants are known to this phase. The implicants are being derived from the source terms by their expansion directed by the cover. This allows us to generate group implicants directly, avoiding the time-consuming implicant expansions and reduct...
متن کاملMinimization of Boolean Functions
This thesis presents two new methods of test-per-clock BIST design for combinational circuits. One of them is based on a transformation of the PRPG code words into test patterns generated by an ATPG tool. This transformation is done by a combinational circuit. For a design of such a circuit two major tasks have to be solved: first, the proper matching between the PRPG code words and the test pa...
متن کامل